Cooperating rewrite processes for natural-language analysis
نویسندگان
چکیده
منابع مشابه
Instructing cooperating assembly robots through situated dialogues in natural language
We present an assembly cell consisting of two cooperating robots and a variety of sensors. It offers a number of complex skills necessary for constructing aggregates from elements of a toy construction set. A high degree of flexibility was achieved because the skills were realised only through sensory feedback, not by resorting to fixtures or specialised tools. The operation of the cell is comp...
متن کاملBilateral brain processes for comprehending natural language.
Comprehension of natural language--stories, conversations, text--is very simple for those doing the comprehending and very complex for cognitive neuroscientists. It also presents a paradox: the advantage of the left hemisphere (LH) for most language tasks is one of the best-established facts about the brain; yet, when it comes to comprehending complex, natural language, the right hemisphere (RH...
متن کاملGaussian Processes for Natural Language Processing
Gaussian Processes (GPs) are a powerful modelling framework incorporating kernels and Bayesian inference, and are recognised as stateof-the-art for many machine learning tasks. Despite this, GPs have seen few applications in natural language processing (notwithstanding several recent papers by the authors). We argue that the GP framework offers many benefits over commonly used machine learning ...
متن کاملCooperating Motion Processes
This paper describes the use of a low level, computationally inexpensive motion detector to initiate a higher level motion tracker based on an elliptical active contour or snake. The contour tracker is in turn used to direct a camera mounted on a robot arm. to track head shaped objects.
متن کاملFunctional and Performance Analysis of Cooperating Sequential Processes
This paper presents some results concerning the structural analysis of sequential proceses cooperating via message passing through a set of buuers. Both functional | boundedness, deadlock-freeness, liveness, existence of home states | and performance | marking ergodicity, computation of visit ratios and insensitive throughput bounds | properties are considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1986
ISSN: 0743-1066
DOI: 10.1016/0743-1066(86)90008-7